#define _CRT_SECURE_NO_WARNINGS 1
#include"BinTree.h"
#include"Queue.h"
int main()
{
	BTNode* node1 = CreatBTNode(1);
	BTNode* node2 = CreatBTNode(2);
	BTNode* node3 = CreatBTNode(3);
	BTNode* node4 = CreatBTNode(4);
	BTNode* node5 = CreatBTNode(5);
	BTNode* node6 = CreatBTNode(6);
	BTNode* node7 = CreatBTNode(7);
	node1->left = node2;
	node1->right = node3;
	node2->left = node4;
	node2->right = node5;
	node3->left = node6;
	node3->right = node7;

	LevelOrder(node1);
	printf("\n");
	bool ret = isCompleteTree(node1);
	printf("%d ", ret);
	return;
}